package JZ9_跳台阶扩展问题;

public class Solution {
    public int jumpFloorII(int target) {
        int[] arr = new int[target];
        int tag = 1;

        for (int i = 0; i < target; i++){
            arr[i] = tag;
            tag += arr[i];
        }
        return arr[target - 1];
    }
}
